Construction of Group Divisible Designs

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semiregular group divisible designs whose duals are semiregular

ABSTRAC"T A construction method for semiregular group divisible designs is given. This method can be applied to yield many classes of (in general, non-symmetric) semiregular group divisible designs whose duals are semiregular group divisible. In particular, the method can be used to construct many classes of transversal designs whose duals are serniregular group divisible designs, but not trans...

متن کامل

A New Method for Construction of MV-optimal Generalized Group Divisible Designs with two Groups

In this article, we consider the construction of generalized group divisible designs with two groups (GGDD (2)) from balanced incomplete block designs (BIBD). We also discuss MV-optimality of these designs.

متن کامل

Group divisible designs GDD(n, n, n, 1; λ1, λ2)

We give a complete solution for the existence problem of group divisible designs (or PBIBDs) with blocks of size k = 3, four groups of size (n, n, n, 1), and any two indices (λ1, λ2). Moreover, we introduce a construction of infinitely many group divisible designs with t groups of size n and one group of size 1. The construction technique utilizes our main result, together with some other known...

متن کامل

Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs

We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds. We present some general constructions including a novel construction for shrinking the index of a master de...

متن کامل

New Digital Fingerprint Code Construction Scheme Using Group-Divisible Design

Combinatorial designs have been used to construct digital fingerprint codes. Here, a new constructive algorithm for an anticollusion fingerprint code based on group-divisible designs is presented. These codes are easy to construct and available for a large number of individuals, which is important from a business point of view. Group-divisible designs have not been used previously as a tool for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013